GENETIC ALGORITHMS AND THE ANDREWS–CURTIS CONJECTURE
نویسندگان
چکیده
منابع مشابه
Genetic algorithms and the Andrews-Curtis conjecture
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of “elementary transformations” which are Nielsen transformations together with an arbitrary conjugation of a relator. It is believed that the Andrews-Curtis conjecture is false; however, not so many possible counterexamples are known. ...
متن کاملphylogeography and genetic diversity of the lesser mouse- eared bat (myotis blythii) in iran
in current study, 63 samples of bat populations collected from differ regions were used for evaluating the geographic variations. twenty cranial and dental characters for traditional morphometric and landmarks method on the ventral, dorsal skull and mandible for geometry morphometric studies were used. statistical analyses of traditional morphometric and geometry morphometric data indicated low...
A Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملCOMPARATIVE COSTS OF THE PRODUCTION, TRANSPORT AND ASSEMBLY STAGES OF PRESTRESSED PRECAST SLABS USING GENETIC ALGORITHMS
In the precast structures, optimization of structural elements is of great interest mainly due to a more rationalized way that elements are produced. There are several elements of precast prestressed concrete that are objects of study in optimization processes, as the prestressed joist applied in buildings slabs. This article inquires into cost minimization of continuous and simply supported sl...
متن کاملOn-Line Algorithms and the k-Server Conjecture
The Work Function Algorithm, a natural algorithm for the k-server problem, is shown to have competitive ratio at most 2k− 1 for all metric spaces. It is also shown that the k-server conjecture, which states that there is an on-line algorithm for the k-server problem with competitive ratio k, holds for all metric spaces with k + 2 points. Furthermore, two refinements of competitive analysis are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 1999
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196799000370